Speeding up Generalized PSR Parsers by Memoization Techniques
نویسندگان
چکیده
منابع مشابه
Generalized Bottom Up Parsers With Reduced Stack Activity
We describe a generalized bottom up parser in which non-embedded recursive rules are handled directly by the underlying automaton, thus limiting stack activity to the activation of rules displaying embedded recursion. Our strategy is motivated by Aycock and Horspool’s approach, but uses a different automaton construction and leads to parsers that are correct for all context-free grammars, inclu...
متن کاملLeveraging Coding Techniques for Speeding up Distributed Computing
Large scale clusters leveraging distributed computing frameworks such as MapReduce routinely process data that are on the orders of petabytes or more. The sheer size of the data precludes the processing of the data on a single computer. The philosophy in these methods is to partition the overall job into smaller tasks that are executed on different servers; this is called the map phase. This is...
متن کاملSpeeding up fuzzy clustering with neural network techniques
We explore how techniques that were developed to improve the training process of artificial neural networks can be used to speed up fuzzy clustering. The basic idea of our approach is to regard the difference between two consecutive steps of the alternating optimization scheme of fuzzy clustering as providing a gradient, which may be modified in the same way as the gradient of neural network ba...
متن کاملReplication techniques for speeding up parallel applications on distributed systems
Traditional programming methods for loosely-coupled systems are based on message-passing. More recently, methods have emerged based for ‘‘virtually’’ sharing data. These methods simplify distributed programming, but are hard to implement efficiently, as loosely-coupled systems do not contain physical shared memory. We introduce a new model, the shared data-object model, that eases the implement...
متن کاملSpeeding up deciphering by hypergraph ordering
The “Gluing Algorithm” of Semaev [Des. Codes Cryptogr. 49 (2008), 47–60] — that finds all solutions of a sparse system of linear equations over the Galois field GF (q) — has average running time O(mq| k 1Xj |), where m is the total number of equations, and ∪k1Xj is the set of all unknowns actively occurring in the first k equations. Our goal here is to minimize the exponent of q in the case whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.309.4